Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.     

Explicit ruin formulas for models with dependence among risks

We show that a simple mixing idea allows one to establish a number of explicit formulas for ruin probabilities and related quantities in collective risk models with dependence among claim sizes and among claim inter-occurrence times. Examples include compound Poisson risk models with completely monotone marginal claim size distributions that are dependent according to Archimedean survival copulas as well as renewal risk models with dependent inter-occurrence times.     

New approach to differential equations with countable impulses

This paper provides a new approach to study the solutions of a class of generalized Jacobi equations associated with the linearization of certain singular flows on Riemannian manifolds with dimension n + 1.A new class of generalized differential operators is defined.We investigate the kernel of the corresponding maximal operators by applying operator theory.It is shown that all nontrivial solutions to the generalized Jacobi equation are hyperbolic,in which there are n dimension solutions with exponential...     

The monotone method for controllability of the nonlinear evolution systems

In this paper,we study the controllability of the nonlinear evolution systems.We establish the controllability results by using the monotone operator theory.No compactness assumptions are imposed in the main results.We present an example to illustrate our results.     

L~p CONTINUITY OF HRMANDER SYMBOL OPERATORS OpS_（0,0） ~m AND NUMERICAL ALGORITHM

If we use Littlewood-Paley decomposition, there is no pseudo-orthogonality for Ho¨rmander symbol operators OpS m 0 , 0 , which is different to the case S m ρ,δ (0 ≤δ < ρ≤ 1). In this paper, we use a special numerical algorithm based on wavelets to study the L p continuity of non infinite smooth operators OpS m 0 , 0 ; in fact, we apply first special wavelets to symbol to get special basic operators, then we regroup all the special basic operators at given scale and prove that such scale operator’s continuity decreases very fast, we sum such scale operators and a symbol operator can be approached by very good compact operators. By correlation of basic operators, we get very exact pseudo-orthogonality and also L 2 → L 2 continuity for scale operators. By considering the influence region of scale operator, we get H 1 (= F 0 , 2 1 ) → L 1 continuity and L ∞→ BMO continuity. By interpolation theorem, we get also L p (= F 0 , 2 p ) → L p continuity for 1 < p < ∞ . Our results are sharp for F 0 , 2 p → L p continuity when 1 ≤ p ≤ 2, that is to say, we find out the exact order of derivations for which the symbols can ensure the resulting operators to be bounded on these spaces.     

A NEW NONCONFORMING MIXED FINITE ELEMENT SCHEME FOR THE STATIONARY NAVIER-STOKES EQUATIONS

In this article, a new stable nonconforming mixed finite element scheme is proposed for the stationary Navier-Stokes equations, in which a new low order CrouzeixRaviart type nonconforming rectangular element is taken for approximating space for the velocity and the piecewise constant element for the pressure. The optimal order error estimates for the approximation of both the velocity and the pressure in L2-norm are established, as well as one in broken H1-norm for the velocity. Numerical experiments are given which are consistent with our theoretical analysis.     

单位球上F(p,q,s)空间到βμ空间的加权Cesàro算子

本文研究了单位球上F(p,q,s)空间到βμ空间的加权Cesàro算子的有界性和紧性问题.利用泛函分析与多复变的方法,获得了单位球上F(p,q,s)空间到βμ空间的加权Cesàro算子为有界算子和紧算子的充要条件.     

一个投影收缩算法的新步长

本文研究了求解单调变分不等式问题的一个投影收缩算法.利用何炳生教授的分析手法,给出了新步长,并且证明了在该步长下算法的全局收敛性.初步的数值试验表明了新步长的实用性.     

Spectral analysis of a high-order Hermitian algorithm for structural dynamics

The spectral analysis of an efficient step-by-step direct integration algorithm for the structural dynamic equation is presented. The proposed algorithm is formulated in terms of two Hermitian finite difference operators of fifth-order local truncation error and it is unconditionally stable with no numerical damping presenting a fourth-order truncation error for period dispersion (global error). In addition, although it is in competition with higher-order algorithms presented in the literature, the computational effort is similar to that of the classical second-order Newmark’s method. The numerical application for nonlinear structural dynamic problems is also considered.     

An efficient linearization technique for mixed 0-1 polynomial problem

This paper addresses a new and efficient linearization technique to solve mixed 0-1 polynomial problems to achieve a global optimal solution. Given a mixed 0-1 polynomial term z=c_tx₁x₂…x_ny, where x₁,x₂,…,x_n are binary (0-1) variables and y is a continuous variable. Also, c_t can be either a positive or a negative parameter. We transform z into a set of auxiliary constraints which are linear and can be solved by exact methods such as branch and bound algorithms. For this purpose, we will introduce a method in which the number of additional constraints is decreased significantly rather than the previous methods proposed in the literature. As is known in any operations research problem decreasing the number of constraints leads to decreasing the mathematical computations, extensively. Thus, research on the reducing number of constraints in mathematical problems in complicated situations have high priority for decision makers. In this method, each n-auxiliary constraints proposed in the last method in the literature for the linearization problem will be replaced by only 3 novel constraints. In other words, previous methods were dependent on the number of 0-1 variables and therefore, one auxiliary constraint was considered per 0-1 variable, but this method is completely independent of the number of 0-1 variables and this illustrates the high performance of this method in computation considerations. The analysis of this method illustrates the efficiency of the proposed algorithm.